Equivalent reliability polynomials modeling EAS and their geometries
نویسندگان
چکیده
منابع مشابه
Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients
We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability polynomials of a graph. Each of these is a specialisation of the Tutte polynomial Σtijxy . It is shown that, unless NP = RP , many of the relevant coefficients do not even have good randomised approximation schemes. We consider the quasiorder induced by approximation ...
متن کاملReliability Polynomials and their Asymptotic Limits for Families of Graphs
We present exact calculations of reliability polynomials R(G, p) for lattice stripsG of fixed widths Ly ≤ 4 and arbitrarily great length Lx with various boundary conditions. We introduce the notion of a reliability per vertex, r({G}, p) = lim|V |→∞R(G, p)1/|V | where |V | denotes the number of vertices in G and {G} denotes the formal limit lim|V |→∞G. We calculate this exactly for various famil...
متن کاملReliability Polynomials: A Survey
Computational and combinatorial problems concerning reliability polynomials are discussed. Recent results are surveyed, and some open problems mentioned. 1 The Basics A full treatment of the subject of reliability polynomials would run to great length; as we proceed, we therefore give some pointers to the literature to those interested in pursuing some particular avenue. We refer the reader to ...
متن کاملEquivalent Norms for Polynomials on the Sphere
We find necessary and sufficient conditions for a sequence of sets EL ⊂ S in order to obtain the inequality Sd |QL|dμ ≤ Cp EL |QL|dμ, ∀L ≥ 0, where 1 ≤ p < +∞, QL is any polynomial of degree smaller or equal than L, μ is a doubling measure and the constant Cp is independent of L. From this description it follows an uncertainty principle for functions in L(S). We consider also weighted uniform v...
متن کاملA note on permutation polynomials and finite geometries
Let F be a finite field of odd cardinality. A polynomial g in F[x] is called a permutation polynomial if g defines a bijective function on F. We will call a polynomial f in F[x] a difference permutation polynomial if f(x + a) -f(x) is a permutation polynomial for every nonzero a in F. Difference permutation polynomials are a special case of planar functions, as defined by Dembowski [2, p. 2271,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of West University of Timisoara - Mathematics and Computer Science
سال: 2015
ISSN: 1841-3307
DOI: 10.1515/awutm-2015-0010